Grokking Oracle Coding Interview
Rate this course
Ask Author
Contribute
Back to course home

0% completed

Vote For New Content
Introduction
Who Should Take This Course?
Oracle Easy
Count Number of Pairs With Absolute Difference K (easy)
Solution: Count Number of Pairs With Absolute Difference K
Degree of an Array (easy)
Solution: Degree of an Array
Find Subsequence of Length K With the Largest Sum (easy)
Solution: Find Subsequence of Length K With the Largest Sum
Rectangle Overlap (easy)
Solution: Rectangle Overlap
Remove All Adjacent Duplicates In String (easy)
Solution: Remove All Adjacent Duplicates In String
Island Perimeter (easy)
Solution: Island Perimeter
Climbing Stairs (easy)
Solution: Climbing Stairs
Move Zeroes (easy)
Solution: Move Zeroes
Excel Sheet Column Title (easy)
Solution: Excel Sheet Column Title
Valid Parentheses (Easy)
Solution: Valid Parentheses
Oracle Medium
Longest Palindromic Substring (medium)
Solution: Longest Palindromic Substring
Single Element in a Sorted Array (medium)
Solution: Single Element in a Sorted Array
Pairs of Songs With Total Durations Divisible by 60 (medium)
Solution: Pairs of Songs With Total Durations Divisible by 60
Search a 2D Matrix II (medium)
Solution: Search a 2D Matrix II
Minimize Maximum of Array (medium)
Solution: Minimize Maximum of Array
Asteroid Collision (medium)
Solution: Asteroid Collision
Combination Sum (medium)
Solution: Combination Sum
Binary Tree Right Side View (medium)
Solution: Binary Tree Right Side View
Sort Colors (medium)
Solution: Sort Colors
Group Anagrams (Medium)
Solution: Group Anagrams
Decode String (Medium)
Solution: Decode String
Number of Islands (medium)
Solution: Number of Islands
Binary Tree Zigzag Level Order Traversal (medium)
Solution: Binary Tree Zigzag Level Order Traversal
Longest Common Subsequence (medium)
Solution: Longest Common Subsequence
Rotting Oranges (medium)
Solution: Rotting Oranges
Meeting Rooms II (medium)
Solution: Meeting Rooms II
Delete Node in a BST (medium)
Solution: Delete Node in a BST
Remove Duplicate Letters (medium)
Solution: Remove Duplicate Letters
Longest Substring Without Repeating Characters (medium)
Solution: Longest Substring Without Repeating Characters (medium)
Search in Rotated Array (medium)
Solution: Search in Rotated Array
Spiral Matrix (medium)
Solution: Spiral Matrix
Container With Most Water (Medium)
Solution: Container With Most Water
3Sum (medium)
Solution: 3Sum
Simplify Path (medium)
Solution: Simplify Path
Next Permutation (medium)
Solution: Next Permutation
Basic Calculator II (medium)
Solution: Basic Calculator II
Merge Intervals (medium)
Solution: Merge Intervals
Restore IP Addresses (medium)
Solution: Restore IP Addresses
Longest Increasing Subsequence (medium)
Solution: Longest Increasing Subsequence
Validate Binary Search Tree (medium)
Solution: Validate Binary Search Tree
Integer to English Words (hard)
Solution: Integer to English Words
Trapping Rain Water (hard)
Solution: Trapping Rain Water
First Missing Positive (hard)
Solution: First Missing Positive
Merge K Sorted Lists (hard)
Solution: Merge K Sorted Lists
Max Points on a Line (hard)
Solution: Max Points on a Line
Sudoku Solver (hard)
Solution: Sudoku Solver
Longest Valid Parentheses (hard)
Solution: Longest Valid Parentheses
Remove Nth Node From End of List (Medium)
Solution: Remove Nth Node From End of List
Median of Two Sorted Arrays (hard)
Solution: Median of Two Sorted Arrays
Constrained Subsequence Sum (hard)
Solution: Constrained Subsequence Sum
Solution: 3Sum

Problem Statement

Given an array of unsorted numbers, find all unique triplets in it that add up to zero.

Examples

Example 1

  • Input: [-3, 0, 1, 2, -1, 1, -2]
  • Output: [[-3, 1, 2], [-2, 0, 2], [-2, 1, 1], [-1, 0, 1]]
  • Explanation: There are four unique triplets whose sum is equal to zero.

Example 2

  • Input: [-5, 2, -1, -2, 3]
  • Output: [[-5, 2, 3], [-2, -1, 3]]
  • Explanation: There are two unique triplets whose sum is equal to zero.

Constraints:

  • 3 <= arr.length <= 3000
  • -105 <= arr[i] <= 105

Solution

This problem follows the Two Pointers pattern and shares similarities with Pair with Target Sum. A couple of differences are that the input array is not sorted and instead of a pair we need to find triplets with a target sum of zero.

To follow a similar approach, first, we will sort the array and then iterate through it taking one number at a time. Let’s say during our iteration we are at number ‘X’, so we need to find ‘Y’ and ‘Z’ such that . At this stage, our problem translates into finding a pair whose sum is equal to “-X” (as from the above equation ).

Another difference from Pair with Target Sum is that we need to find all the unique triplets. To handle this, we have to skip any duplicate number. Since we will be sorting the array, so all the duplicate numbers will be next to each other and are easier to skip.

Step-by-Step Algorithm

  1. Sort the Array:

    • Sort the input array in non-decreasing order. This helps in easily skipping duplicate elements and applying the two-pointer technique.
  2. Iterate through the Array:

    • Use a for loop to iterate through the array, stopping at the third-to-last element.
    • For each element, check if it's the same as the previous one to avoid duplicates.
    • If it's the same, skip to the next iteration.
  3. Fix the Current Element and Find Pairs:

    • Fix the current element and use two pointers to find pairs whose sum is the negative of the fixed element (targetSum = -arr[i]).
    • The left pointer starts from the next element (i + 1) and the right pointer starts from the end of the array.
  4. Find Pairs with Two Pointers:

    • Calculate the sum of the left pointer and the right pointer (currentSum = arr[left] + arr[right]).
    • If the currentSum equals targetSum, add the triplet to the list ([-targetSum, arr[left], arr[right]]) and move both pointers to the next unique elements.
    • If currentSum is less than targetSum, move the left pointer to the right to increase the sum.
    • If currentSum is greater than targetSum, move the right pointer to the left to decrease the sum.
  5. Skip Duplicates:

    • Ensure that the left and right pointers skip duplicate elements to avoid counting the same triplet multiple times.
  6. Return the Result:

    • After processing all elements, return the list of unique triplets.

Algorithm Walkthrough

Let's visualize example 2 via diagram below.

Image
  1. Sort the Array:

    • Input: [-5, 2, -1, -2, 3]
    • Sorted: [-5, -2, -1, 2, 3]
  2. Fix -5 (index 0), left pointer at -2 (index 1), and right pointer at 3 (index 4):

    • Target Sum: -(-5) = 5
    • Sum = -2 + 3 = 1 (less than targetSum), move left to -1 (index 2)
    • Sum = -1 + 3 = 2 (less than targetSum), move left to 2 (index 3)
    • Sum = 2 + 3 = 5, found triplet [-5, 2, 3]
    • Move left to 4 and right to 3 (end of this iteration)
  3. Fix -2 (index 1), left pointer at -1 (index 2), and right pointer at 3 (index 4):

    • Target Sum: -(-2) = 2
    • Sum = -1 + 3 = 2, found triplet [-2, -1, 3]
    • Move left to 2 and right to 3
  4. Fix -1 (index 2), left pointer at 2 (index 3), and right pointer at 3 (index 4):

    • Target Sum: -(-1) = 1
    • Sum = 2 + 3 = 5 (greater than targetSum), move right to 2 (end of this iteration)
  5. End of loop since all elements are processed.

Output: [[ -5, 2, 3], [ -2, -1, 3]]

Code

Here is what our algorithm will look like:

Java

. . . .

Complexity Analysis:

Time Complexity

  • Sorting the array: The first step in the algorithm is to sort the input array, which takes , where N is the number of elements in the input array.

  • Outer loop: The main loop runs for each element in the array, excluding the last two, as those will be processed during the pair search. The loop runs approximately times, which is .

  • Inner loop (pair search): For each element processed by the outer loop, the algorithm uses the two-pointer technique to search for pairs that sum to the target value. The two-pointer search for each element takes time since the pointers traverse the entire array in a linear fashion.

  • Overall time complexity: The total time complexity is the sum of the time spent sorting the array and the time spent in the two-pointer search for each element. This gives us a total time complexity of . Since dominates for large values of N, the overall time complexity is .

Space Complexity

  • Sorting the array: Sorting the array requires additional space, and this adds space complexity.

  • Triplets storage: The space used to store the resulting triplets is , where K is the number of triplets found. In the worst case, this could be proportional to , especially if there are many valid triplets.

  • Additional variables: The algorithm uses constant extra space for variables like left, right, and currentSum, so this adds to the space complexity.

Overall space complexity: for storing the output triplets and for extra variables, resulting in overall.

3Sum (medium)
Simplify Path (medium)
Mark as Completed

On this page

Problem Statement

Examples

Example 2

Solution

Step-by-Step Algorithm

Algorithm Walkthrough

Code

Complexity Analysis:

Time Complexity

Space Complexity